What is Wrong with GUIs for Theorem Provers ?
نویسندگان
چکیده
Direct manipulation graphical user interfaces (GUIs) are widely available in virtually every application domain and, increasingly, for theorem proving assistants (TPAs). We argue both that the command-line based interaction paradigm has real advantages for theorem proving, and that some advantages of GUIs are diminished or even reversed for TPAs.
منابع مشابه
On The Integration of Decision Diagrams in High Order Logic Based Theorem Provers: a Survey
This survey discuss approaches that integrate Decision Diagrams inside High Order Logic based Theorem provers. The approaches can be divided in two kinds, one is based on building a translation between model checker and theorem prover, the second is based on embedding the model checker algorithms inside the theorem prover. A comparison between both is discussed in detail. The paper also tries t...
متن کاملA Survey on Embedding Programming Logics in a Theorem Prover
Theorem provers were also called ’proof checkers’ because that is what they were in the beginning. They have grown powerful, however, capable in many cases to automatically produce complicated proofs. In particular, higher order logic based theorem provers such as HOL and PVS became popular because the logic is well known and very expressive. They are generally considered to be potential platfo...
متن کاملPostpartum Haemorrhage: Still a Big Issue in Maternity Care - What is Going Wrong?
Background and aim: Postpartum haemorrhage remains one of the main leading causes of maternal mortality across the world. This is despite a wide-spread coverage of active third stage of labour care in many countries. Reflecting on emerging evidence in this context, a discussion of associated factors which should be considered in interpretation of the evidence and its implications is presented ...
متن کاملSpecifying Theorem Provers in a Higher-Order Logic Programming Language
Since logic programming systems directly implement search and unification and since these operations are essential for the implementation of most theorem provers, logic programming languages should make ideal implementation languages for theorem provers. We shall argue that this is indeed the case if the logic programming language is extended in several ways. We present an extended logic progra...
متن کاملTheorem Provers Survey
Theorem provers are computer programs capable of nding proofs for theorems within mathematical theories. Theorem provers have been an important part of the computer science eld. The birth of theorem provers could be traced to the 50's with the introduction of the electronic computer to the universities. This paper presents the actual classiication of theorem provers, and present an evaluation o...
متن کامل